Regular Separability of Well Structured Transition Systems
نویسندگان
چکیده
We investigate languages recognized by well structured transition systems (WSTS) with upward (resp. downward) compatibility. We show that under mild assumptions every two disjoint WSTS languages are regular separable, i.e., there exists a regular language containing one of them and disjoint from the other. In particular, if a language, as well as its complement, are both recognized by a WSTS, then they are necessarily regular. 1998 ACM Subject Classification F.1.1 Models of Computation.
منابع مشابه
Regular Separability of Parikh Automata
We investigate a subclass of languages recognized by vector addition systems, namely languages of nondeterministic Parikh automata. While the regularity problem (is the language of a given automaton regular?) is undecidable for this model, we show surprising decidability of the regular separability problem: given two Parikh automata, is there a regular language that contains one of them and is ...
متن کاملUnboundedness problems for languages of vector addition systems
A vector addition system (VAS) with an initial and a final marking and transition labels induces a language. In part because the reachability problem in VAS remains far from being wellunderstood, it is difficult to devise decision procedures for such languages. This is especially true for checking properties that state the existence of infinitely many words of a particular shape. Informally, we...
متن کاملDeciding Piecewise Testable Separability for Regular Tree Languages
The piecewise testable separability problem asks, given two input languages, whether there exists a piecewise testable language that contains the first input language and is disjoint from the second. We prove a general characterisation of piecewise testable separability on languages in a well-quasiorder, in terms of ideals of the ordering. This subsumes the known characterisations in the case o...
متن کاملTransition from First Drug Use to Regular Injection among People Who Inject Drugs in Iran
Background: The study aimed to evaluate the interval between first drug use and regular injection and factors associated with transition from first injection into premature regular injection among people who inject drugs (PWIDs).Methods: In a multicenter cross-sectional study, we recruited 400 PWIDs using snowball sampling. Age of first drug use, age of initiation of regular injection, and demo...
متن کاملStructured Perceptron with Inexact Search
Most existing theory of structured prediction assumes exact inference, which is often intractable in many practical problems. This leads to the routine use of approximate inference such as beam search but there is not much theory behind it. Based on the structured perceptron, we propose a general framework of “violation-fixing” perceptrons for inexact search with a theoretical guarantee for con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1702.05334 شماره
صفحات -
تاریخ انتشار 2017